theorem proving造句
例句与造句
- A member of the herbrand base is called atom in automatic theorem proving
在自动定理证明中,海尔勃朗基的成员也称为原子。 - A new method based on numeric computation for automated geometric theorem proving and discovering is shown
摘要该文提出了利用数值方法进行几何定理自动搜索的方法，并基于此方法开发了几何定理动态搜索系统。 - Singapore : world scientific , 1994 . 4 li h , wu y . automated theorem proving in projective geometry with cayley and bracket algebras
其中特征列方法是定理机器证明与方程求解的基础，也是数学机械化领域目前研究的核心内容。 - An convergence theorem proved and in order to speed convergence of working - set algorithm , constrained matrix derived from abs in working - set method corrected
为提高算法的收敛速度，对工作集算法中由abs算法生成的约束阵进行了校正 - In this paper , we do two things . first , for theorem proving problem such like ( vx ) ( 3y ) p ( x , y ) , we present a method for extracting procedure from the proofs generated by the resolution principle
) y ) p ( x ， y )的定理证明问题，本文从分析归结证明树中的每个节点入手，提取归结证明的过程信息，生成一个程序。 - It's difficult to find theorem proving in a sentence. 用theorem proving造句挺难的
- In 1989 , academician wu wen - tsun forwards wu differential characteristic method which establish theoretical basis for mechanical theorem proving of differential geometry and the research of automatic reasoning
1989年吴文俊院士提出了吴?微分特征列法，为微分几何定理的机械化证明和自动推理的理论研究奠定了理论基础。 - 6 wu w t . basic principles of mechanical theorem proving in geometries . volume i : part of elementary geometries , beijing : science press , 1984 ; springer 1994 . 7 wu w t . mathematics mechanization
2提供了一种基于吴方法的增元消元法的求解方程组独立个数的数学新思路，不仅可以被数学领域而且可以被工程领域里的研究人员所借鉴。 - 1 wu w t . on the decision problem and the mechanization of theorem - proving in elementary geometry . scientia sinica , 1978 , : 159 - 172 . re - published in em automated theorem proving : after 25 years , 1984 , pp . 213 - 234
本文第一作者于上世纪七十年代末开始从事数学机械化研究，致力于实现推理与方程求解的自动化，并创立了几何定理机器证明的吴方法与方程求解的特征列方法。 - In proposbonal calculus , the processing ofresoluhon pdriciple have combination explosion naturally so , how to eltw combinaion explosion in the processing of resolution ( genetal showed computationaily hard problem ) is an in1portan subject in automated theorem proving
命题逻辑系统中的归结原理本质上存在组合问题，因此，如何避免组合问题(通常以计算复杂性的形式出现)是自动推理研究中的一个重要课题。 - Secondly , definitions of a extended bethe tree , bethe tree and cayley tree are introduced . further , the even - odd markov chain fields and markov chain fields indexed by a extended bethe tree , bethe tree and cayley tree are defined . subsequently the strong limit theorems proved above are applied to the study of all kinds of even - odd markov chain fields and markov chain fields defined above , which both extend the conclusions in [ 30 ] and [ 39 ] and prove a class of strong limit theorems for the even - odd markov chain fields and markov chain fields . as corollaries , we obtain some strong limit theorems for the frequencies of occurrence of states and ordered couples of states for the even - odd markov chain fields and markov chain fields . lastly , some coarse estimates are gained about the state occurrence frequencies for all kinds of even - odd markov chain fields and markov chain fields defined in the paper
然后把前面所证得的一类强极限定理应用到本文中所定义的各种奇偶马尔可夫链场、马尔可夫链场的研究工作中，从而推广了[ 30 ]和[ 39 ]中的结论，获得了本论文中所定义的各种奇偶马尔可夫链场、马尔可夫链场的一类强极限定理。作为这一类强极限定理的推论得到了状态和状态序偶出现频率的一类强极限定理。最后，给出了本论文中所定义的各种奇偶马尔可夫链场、马尔可夫链场上状态出现频率的若干粗略估计。 - In this paper , it s applications were explained from seven different fields , the common zeros of two polynomials , the multiplicities of roots and the discrimination of a polynomial , searching the equations suitable for a algebraic number , implicating a rational curve over the plane , computing the zeros of a nonlinear algebraic equation and gathering the discrimination surface of the sas in automated theorem proving on inequalities
本文从7个方面阐述了结式的应用，包括判断2个多项式的公共零点，判定多项式是否有重根，计算多项式的判别式，寻找代数数满足的方程，平面有理曲线的隐式化，非线性代数方程组求解和不等式机器证明中半代数系统边界曲面的获得等。 - In latter part of chapter three , some exciting properties of the revised lagrangian function discussed first , which leads to form a dual algorithm of cora or cot . convergence theorem proved by banach perturbation theorem , bertsekas implicit function theorem ii and by analyzing hesse matrix of revised largrangian function
另一类是构造相应的lagrange函数及其一种对偶算法的迭代格式，讨论了修正lagrange函数的性质，并借助banach扰动定理及bertsekas第h隐函数定理，及对修正lagrange函数hesse阵分析，证明了该算法的收敛性 - We detailed toeplitz operator with unomodular symbol , and generated the theorem proved by michael sand in [ 2 ] from h to h + c ( t ) . in the second part of this paper , the author discussed simply when multipliction of two toeplitz operators with symbol in h + c ( t ) or in l . we got two conclusions by analyzing symbol of toeplitz operators . the last , we investigated whether multiplication of two toeplitz operators , which range included all non - cyclic vectors of backward shift , is surjective , and partly answered the question about surjective toeplitz algebra posed by michael sand in [ 2 ]
对于单个的toeplitz算子，考虑其符号的内外分解，得到了它的满射只与其幺模部分有关的结论，详细地讨论了符号为幺摸函数的toeplitz算子的各种情况，在讨论符号在h ~的特殊情形时，推广michaelsand [ 2 ]中的定理2到h ~ + c ( t ) ，第二部分简单地讨论了符号在h ~ + c ( t )以及l ~中的两个toeplitz算子的乘积的满射情况，先对toeplitz算子的符号进行分析得到两个结论，最后考察了toeplitz算子的乘积的值域包含后移算子的所有非循环向量的满射情况，部分地回答了michaelsand在[ 2 ]中提出的toeplitz代数满射问题。 - The thesis consists of four sections . in section one , we introduce some background of the topic , in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic - the algebraic structure of the plus cupping turing degrees , in section three , we outline the basic principles of the priority tree argument , one of the main frameworks and tools of theorem proving in computability theory , and in section four , we prove a new result concerning the algebraic structure of the plus cupping turing degrees that there exist two computably enumerable degrees a , b such that a , b ? pc , and the join a v b of a and b is high
本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题?加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a ， b ，满足a ， b pc ，而且a和b的并a b是一个高度。